Energy-Efficient Scheduling For Small Pervasive Computing Devices Under Fixed-Priority Multi-Subtask Model

نویسندگان

  • Zhigang Gao
  • Zhaohui Wu
  • Man Lin
چکیده

In a pervasive computing environment, energy is one of the critical restriction factors of embedded devices. Dynamic voltage scaling (DVS) has been proven to be an effective method for reducing energy consumption of processors. This paper proposes an energy-saving algorithm under the fixed priority multi-subtask model. This algorithm includes two parts: first, it exploits the relationship among tasks to set the slowdown factors of subtasks; second, it dynamically reclaims and reuses the slack time of precedent subtasks during the execution of tasks. Experimental results show this method can reduce energy consumption effectively while guaranteeing the real-time requirements of systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

متن کامل

Multiprocessor Scheduling For Real Time Systems Embedded Systems

energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...

متن کامل

Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems

This paper considers the problem of timing analysis for a quite general hard real-time periodic task set on a uniprocessor using fixed priority methods. Periodic tasks are decomposed into serially executed subtasks, where each subtask is characterized by an execution time, a fixed priority, and a deadline. A method for determining the schedulability of each task is presented along with its theo...

متن کامل

Fixed priority scheduling periodic tasks with varying execution priority

This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...

متن کامل

An Optimal Utilization of Cloud Resources using Adaptive Back Propagation Neural Network and Multi-Level Priority Queue Scheduling

With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Intelligent Automation & Soft Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009